A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data
نویسنده
چکیده
We introduce an approximation of the Weisfeiler-Lehman graph kernel algorithm aimed at improving the computation time of the kernel when applied to Resource Description Framework (RDF) data. RDF is the representation/storarge format of the semantic web and it essentially represents a graph. One direction for learning from the semantic web is using graph kernel methods on RDF. This is a very generic and flexible approach to learning from the semantic web, since it requires no knowledge of the semantics of the dataset and can be applied to nearly all linked data. Graph kernel computation is in general slow, since it is often based on computing some form of expensive (iso)morphism between graphs. We present an approximation of the Weisfeiler-Lehman (WL) graph kernel [2] to speed up the computation of this kernel on RDF data. Typically, applying graph kernels to RDF is done by extracting subgraphs from a large underlying RDF graph and computing the kernel on this set of subgraphs. Our approximation exploits the fact that the subgraph instances are extracted from the same RDF graph. We adapt the WL algorithm to compute the kernel directly on the underlying graph, while maintaining a subgraph perspective for each instance. We compare the performance of this kernel to the graph kernels designed for RDF described in [1]. For this comparison we use three property prediction tasks on RDF data from two datasets. In each task we try to predict a property for a certain class of resources. For instance, the first task is predicting the affilition of the people in a research institute, for which the data is modeled as RDF. Furthermore, we compare the computation time of the different kernels. In all three tasks, our kernel shows performance that is better than the regular Weisfeiler-Lehman kernel applied to RDF. Also it is increasingly more efficient as the number of instances grows by exploiting the fact that the RDF instance subgraphs share vertices and edges in the underlying large RDF graph. Furthermore, the presented kernel is faster and/or shows better classification performance than the intersection subtree and intersection graph kernels for RDF, introduced in [1]. The performance difference between the presented approximation of the WL Subtree kernel and the regular version requires further investigation.
منابع مشابه
A Fast and Simple Graph Kernel for RDF
In this paper we study a graph kernel for RDF based on constructing a tree for each instance and counting the number of paths in that tree. In our experiments this kernel shows comparable classification performance to the previously introduced intersection subtree kernel, but is significantly faster in terms of computation time. Prediction performance is worse than the state-of-the-art Weisfeil...
متن کاملGraph Kernels for Task 1 and 2 of the Linked Data Data Mining Challenge 2013
In this paper we present the application of two RDF graph kernels to task 1 and 2 of the linked data data-mining challenge. Both graph kernels use term vectors to handle RDF literals. Based on experiments with the task data, we use the Weisfeiler-Lehman RDF graph kernel for task 1 and the intersection path tree kernel for task 2 in our final classifiers for the challenge. Applying these graph k...
متن کاملGlobal Weisfeiler-Lehman Kernel
Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures only. On the other hand, kernels that do take global graph properties into account may not scale well to large graph databases. Here we propose to start exploring the space between local and global ...
متن کاملGraph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions
In this paper we present a novel graph kernel framework inspired the by the Weisfeiler-Lehman (WL) isomorphism tests. Any WL test comprises a relabelling phase of the nodes based on test-specific information extracted from the graph, for example the set of neighbours of a node. We defined a novel relabelling and derived two kernels of the framework from it. The novel kernels are very fast to co...
متن کاملWeisfeiler-Lehman Graph Kernels
In this article, we propose a family of efficient kernels for large graphs with discrete node labels. Key to our method is a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. It maps the original graph to a sequence of graphs, whose node attributes capture topological and label information. A family of kernels can be defined based on this Weisfeiler-L...
متن کامل